On q-BFGS algorithm for unconstrained optimization problems
نویسندگان
چکیده
منابع مشابه
A Modified BFGS Algorithm for Unconstrained Optimization
In this paper we present a modified BFGS algorithm for unconstrained optimization. The BFGS algorithm updates an approximate Hessian which satisfies the most recent quasi-Newton equation. The quasi-Newton condition can be interpreted as the interpolation condition that the gradient value of the local quadratic model matches that of the objective function at the previous iterate. Our modified al...
متن کاملAn Efficient Conjugate Gradient Algorithm for Unconstrained Optimization Problems
In this paper, an efficient conjugate gradient method for unconstrained optimization is introduced. Parameters of the method are obtained by solving an optimization problem, and using a variant of the modified secant condition. The new conjugate gradient parameter benefits from function information as well as gradient information in each iteration. The proposed method has global convergence und...
متن کاملA modified nonmonotone BFGS algorithm for unconstrained optimization
In this paper, a modified BFGS algorithm is proposed for unconstrained optimization. The proposed algorithm has the following properties: (i) a nonmonotone line search technique is used to obtain the step size [Formula: see text] to improve the effectiveness of the algorithm; (ii) the algorithm possesses not only global convergence but also superlinear convergence for generally convex functions...
متن کاملOn the Global Convergence of the BFGS Method for Nonconvex Unconstrained Optimization Problems
This paper is concerned with the open problem whether BFGS method with inexact line search converges globally when applied to nonconvex unconstrained optimization problems. We propose a cautious BFGS update and prove that the method with either Wolfe-type or Armijo-type line search converges globally if the function to be minimized has Lipschitz continuous gradients.
متن کاملModified Seeker Optimization Algorithm for Unconstrained Optimization Problems
Seeker optimization algorithm (SOA) is a novel search algorithm based on simulating the act of human searching, which has been shown to be a promising candidate among search algorithms for unconstrained function optimization. In this article we propose a modified seeker optimization algorithm. In order to enhance the performance of SOA, our proposed approach uses two search equations for produc...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Advances in Difference Equations
سال: 2020
ISSN: 1687-1847
DOI: 10.1186/s13662-020-03100-2